Programming complexity - PDFSEARCH.IO - Document Search Engine

Programming complexity
Results: 456

#	Item
51	CS264: Beyond Worst-Case Analysis Lecture #1: Three Motivating Examples∗ Tim Roughgarden† September 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:29:21 Computational complexity theory Analysis of algorithms Operations research Linear programming Convex optimization Algorithm Smoothed analysis Best worst and average case Time complexity Sorting algorithm Merge sort Simplex algorithm
52	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2011-10-07 01:19:59 Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method Mathematical optimization Mechanism design
53	Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K. Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2011-07-07 11:03:52 Model theory Constraint programming Logical truth Mathematical logic Formal languages Structure Interpretation Satisfiability Substitution Constraint satisfaction problem Complexity of constraint satisfaction Boolean satisfiability problem
54	CS369N: Beyond Worst-Case Analysis Lecture #7: Smoothed Analysis∗ Tim Roughgarden† November 30, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-07 19:36:40 Operations research Computational complexity theory Linear programming Mathematical optimization Artificial neural networks Perceptron Simplex algorithm Smoothed analysis Algorithm Simplex Time complexity Polynomial
55	RTGBeing Stubborn: Developing Optimal Solution Strategies for a Scheduling Problem Despite its NP-Hardness Dr. Oliver Sinnen Department of Electrical and Computer Engineering Add to Reading List Source URL: grk1855.tu-dortmund.de Language: English - Date: 2015-06-25 08:55:11 Computational complexity theory Theory of computation Combinatorial optimization Complexity classes Operations research Integer programming Heuristic Branch and bound NP Optimization problem Pruning Reduction
56	The complexity of satisfaction problems in Reverse Mathematics Ludovic Patey Laboratoire PPS, Université Paris Diderot, Paris, FRANCE Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2014-03-18 04:19:11 Logic Mathematics Constraint programming Abstraction Model theory Boolean satisfiability problem Electronic design automation Logic in computer science Complexity of constraint satisfaction Constraint satisfaction problem Satisfiability Binary relation
57	´ APPROXIMABILITY OF THE DISCRETE FRECHET DISTANCE∗ 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:47:35 Circuit complexity NC Systems science Dynamic programming Systems theory Theoretical computer science
58	Closing the Gap Between Short and Long XORs for Model Counting Shengjia Zhao Sorathan Chaturapruek Computer Science Department Computer Science Department Add to Reading List Source URL: ai2-website.s3.amazonaws.com Language: English - Date: 2016-05-10 13:04:53 Computational complexity theory Convex optimization Probability Mathematics Coding theory Error detection and correction Low-density parity-check code PP Bayesian network Linear programming
59	THE COMPLEXITY OF SATISFACTION PROBLEMS IN REVERSE MATHEMATICS LUDOVIC PATEY Abstract. Satisfiability problems play a central role in computer science and engineering as a general framework for studying the complexity of Add to Reading List Source URL: ludovicpatey.com Language: English - Date: 2015-02-06 12:14:26 Automated theorem proving Logic programming Logic in computer science Boolean algebra Model theory Substitution Boolean satisfiability problem Interpretation Relationships among probability distributions Lifting theory
60	IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 7, JULYrequiring the storage of O (d) cells. Since each cell has j6j + 1 entries, the space complexity is in O(min(d2 j6j log r; d(n 0 d)j6j log j6j)) bits. Th Add to Reading List Source URL: dept.stat.lsa.umich.edu Language: English - Date: 2008-06-23 16:56:21 Statistical theory Operations research Systems engineering Signal processing Digital signal processing Quantization Dynamic programming KullbackLeibler divergence Information theory Optimal design

UPDATE